Decomposition of tableaus annihilated by zero-dimensional ideals
نویسندگان
چکیده
منابع مشابه
Primary decomposition of zero-dimensional ideals over finite fields
A new algorithm is presented for computing primary decomposition of zero-dimensional ideals over finite fields. Like Berlekamp’s algorithm for univariate polynomials, the new method is based on the invariant subspace of the Frobenius map acting on the quotient algebra. The dimension of the invariant subspace equals the number of primary components, and a basis of the invariant subspace yields a...
متن کاملUnivariate Representat ion of Zero - dimensional Ideals
To give an efficiently computable representation of the zeros of a zero-dimensional ideal I, Rouillier (1996) introduced the rational univariate representation (RUR) as an extension of the generalized shape lemma (GSL) proposed by Alonso et al. (1996). In this paper, we propose a new method to compute the RUR of the radical of I, and report on its practical implementation. In the new method, th...
متن کاملThe Core of Zero-dimensional Monomial Ideals
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two an...
متن کاملApproximate computation of zero-dimensional polynomial ideals
The Buchberger-Möller algorithm is a well-known efficient tool for computing the vanishing ideal of a finite set of points. If the coordinates of the points are (imprecise) measured data, the resulting Gröbner basis is numerically unstable. In this paper we introduce a numerically stable Approximate Vanishing Ideal (AVI) Algorithm which computes a set of polynomials that almost vanish at the gi...
متن کاملPrimary decomposition of zero-dimensional ideals: Putting Monico’s algorithm into practice
Monico published in [Journal of Symbolic Computation, 34(5):451–459, 2002] an algorithm to compute the primary decomposition of a zero-dimensional ideal, that mostly relies on a characteristic polynomial computation modulo the input ideal, and its factorization. We revisit this algorithm, and discuss Maple and Magma implementations that contradict the somehow pessimistic conclusions of Monico’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2003
ISSN: 0021-8693
DOI: 10.1016/s0021-8693(03)00417-4